منابع مشابه
Monte Carlo Markov Chain Exact Inference for Binomial Regression Models
Current methods for conducting exact inference for logistic regression are not capable of handling large data sets due to memory constraints caused by storing large networks. We provide and implement an algorithm which is capable of conducting (approximate) exact inference for large data sets. Various application fields, such as genetic epidemiology, in which logistic regression models are fit ...
متن کاملThe Double Chain Markov Model
Among the class of discrete time Markovian processes, two models are widely used, the Markov chain and the Hidden Markov Model. A major di erence between these two models lies in the relation between successive outputs of the observed variable. In a visible Markov chain, these are directly correlated while in hidden models they are not. However, in some situations it is possible to observe both...
متن کاملA New Model to Speculate CLV Based on Markov Chain Model
The present study attempts to establish a new framework to speculate customer lifetime value by a stochastic approach. In this research the customer lifetime value is considered as combination of customer’s present and future value. At first step of our desired model, it is essential to define customer groups based on their behavior similarities, and in second step a mechanism to count current ...
متن کاملOn extinction time of a generalized endemic chain-binomial model.
We considered a chain-binomial epidemic model not conferring immunity after infection. Mean field dynamics of the model has been analyzed and conditions for the existence of a stable endemic equilibrium are determined. The behavior of the chain-binomial process is probabilistically linked to the mean field equation. As a result of this link, we were able to show that the mean extinction time of...
متن کاملMarkov Chain and Hidden Markov Model
Figure 1. Finite state machine for a Markov chain X0 → X1 → X2 → · · · → Xn where the random variables Xi’s take values from I = {S1, S2, S3}. The numbers T (i, j)’s on the arrows are the transition probabilities such that Tij = P (Xt+1 = Sj|Xt = Si). Definition 1.2. We say that (Xn)n≥0 is a Markov chain with initial distribution λ and transition matrix T if (i) X0 has distribution λ; (ii) for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics
سال: 2013
ISSN: 2152-7385,2152-7393
DOI: 10.4236/am.2013.412236